On the orientable genus of graphs with bounded nonorientable genus
نویسنده
چکیده
A conjecture of Robertson and Thomas on the orientable genus of graphs with a given nonorientable embedding is disproved.
منابع مشابه
On the Connectivity of Graphs Embedded in Surfaces
In a 1973 paper, Cooke obtained an upper bound on the possible connectivity of a graph embedded in a surface (orientable or nonorientable) of fixed genus. Furthermore, he claimed that for each orientable genus #>0 (respectively, nonorientable genus # >0, # {2) there is a complete graph of orientable genus # (respectively, nonorientable genus # ) and having connectivity attaining his bound. It i...
متن کاملPolynomial-Time Approximation Schemes
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-connectivity survivable-network design, and subset TSP. The schemes run in O(n log n) time for graphs embedded on both orientable and nonorientable surfaces. This work generalizes the PTAS frameworks of Borradaile, Klein, ...
متن کاملComplete Nonorientable Minimal Surfaces in a Ball of R
The existence of complete minimal surfaces in a ball was proved by N. Nadirashvili in 1996. However, the construction of such surfaces with nontrivial topology remained open. In 2002, the authors showed examples of complete orientable minimal surfaces with arbitrary genus and one end. In this paper we construct complete bounded nonorientable minimal surfaces in R3 with arbitrary finite topology...
متن کاملThe orientable genus of some joins of complete graphs with large edgeless graphs
In an earlier paper the authors showed that with one exception the nonorientable genus of the graph Km +Kn with m ≥ n−1, the join of a complete graph with a large edgeless graph, is the same as the nonorientable genus of the spanning subgraph Km+Kn = Km,n. The orientable genus problem for Km +Kn with m ≥ n−1 seems to be more difficult, but in this paper we find the orientable genus of some of t...
متن کاملThe orientable genus of certain complete tripartite graphs
In 1969, White conjectured that the orientable genus of the complete tripartite graph Kl,m,n, with l ≥ m ≥ n, is ⌈ (l−2)(m+n−2) 4 ⌉ . In this talk we describe progress on this conjecture. We can show that White’s conjecture is true in the cases where (m, n), reduced modulo 4, is (0, 0), (0, 2), (1, 1), (2, 0), (2, 1), (2, 2), (2, 3) or (3, 3). We discuss similarities and differences between our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 182 شماره
صفحات -
تاریخ انتشار 1998